Topological Pooling on Graphs
نویسندگان
چکیده
Graph neural networks (GNNs) have demonstrated a significant success in various graph learning tasks, from classification to anomaly detection. There recently has emerged number of approaches adopting pooling operation within GNNs, with goal preserve attributive and structural features during the representation learning. However, most existing operations suffer limitations relying on node-wise neighbor weighting embedding, which leads insufficient encoding rich topological structures node attributes exhibited by real-world networks. By invoking machinery persistent homology concept landmarks, we propose novel layer witness complex-based embedding mechanism that allow us systematically integrate hidden information at both local global levels. Specifically, design new learnable representations Wit-TopoPool simultaneously extract discriminative graphs. Experiments 11 diverse benchmark datasets against 18 baseline models conjunction tasks indicate significantly outperforms all competitors across datasets.
منابع مشابه
On H-Topological Intersection Graphs
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. Our paper is the first study of the recognition and dominating set problems of this large collection of intersection classes of graphs. We negatively ...
متن کاملOn Topological Numbers of Graphs
This paper introduces the notion of discrete t-set graceful graphs and obtains some of their properties. It also examines the interrelations among different types of set-indexers, namely, set-graceful, set-semigraceful, topologically set-graceful (t-set graceful), strongly t-set graceful and discrete t-set graceful and establishes how all these notions are interdependent or not. AMS Mathematics...
متن کاملThe Topological Indices of some Dendrimer Graphs
In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.
متن کاملTopological Indices Based on Topological Distances in Molecular Graphs
Three new distance—based topological indices are described; two of them, D and D1 (mean distance topological indices, for any graphs, and for acyclic graphs, respectively) have a modest discriminating ability but may be useful for correlations, e. g. with octane numbers. The third index, J (average distance sum connectivity) is the least degenerate single topological index proposed till now. Th...
متن کاملOn Complete Topological Subgraphs of Certain Graphs
Let G he a graph . We say that G contains a complete k-gon if there are !c vertices of G any two of which are connected by an edge, we say that it contains a complete topological k-gon if it contains k vertices any two of which are connected by paths no two of which have a common vertex (except endpoints) . Following G . DIRAC we will denote complete k-gons by -k = and complete topological k-go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i6.25866